SYMBOL INDEX (170 symbols across 31 files)

FILE: array-minimum-distance/array-minimum-distance.go
  constant MaxUint (line 12) | MaxUint = ^uint(0)
  constant MinUint (line 13) | MinUint = 0
  constant MaxInt (line 14) | MaxInt = int(MaxUint >> 1)
  constant MinInt (line 15) | MinInt = -MaxInt - 1
  function Abs (line 17) | func Abs(x int) int {
  function minDist (line 27) | func minDist (arr []int, n, x, y int) int {
  function main (line 41) | func main() {

FILE: array-minimum-distance/array-minimum-distance_test.go
  function TestAbs (line 15) | func TestAbs(t *testing.T) {
  function TestMinDist (line 37) | func TestMinDist(t *testing.T) {

FILE: array-rotation/array-rotation.go
  function leftRotate (line 12) | func leftRotate(arr []int, d int, n int){
  function leftRotateByOne (line 18) | func leftRotateByOne(arr []int, n int){
  function printArray (line 27) | func printArray(arr []int, size int){
  function main (line 37) | func main() {

FILE: array-rotation/array-rotation_test.go
  function TestLeftRotate (line 15) | func TestLeftRotate(t *testing.T) {

FILE: array-smallest-missing-number/array-smallest-missing-number.go
  function findFirstMissing (line 13) | func findFirstMissing(arr []int, start, end int) int {
  function main (line 37) | func main() {

FILE: array-smallest-missing-number/array-smallest-missing-number_test.go
  function TestFindFirstMissing (line 15) | func TestFindFirstMissing(t *testing.T) {

FILE: binary-search-tree-1-insertion/binary-search-tree-1-insertion.go
  type Node (line 12) | type Node struct
    method Init (line 19) | func (n *Node) Init(data int) *Node {
  function New (line 27) | func New(data int) *Node {
  function Search (line 32) | func Search(root *Node, key int) *Node {
  function PrintInOrder (line 49) | func PrintInOrder(root *Node) {
  function Insert (line 58) | func Insert(node *Node, key int) *Node {
  function main (line 75) | func main() {

FILE: binary-search-tree-1-insertion/binary-search-tree-1-insertion_test.go
  function TestBinarySearchTreeNew (line 15) | func TestBinarySearchTreeNew(t *testing.T) {

FILE: binary-tree-1-introduction/binary-tree-1-introduction.go
  type Node (line 12) | type Node struct
    method Init (line 19) | func (n *Node) Init(data int) *Node {
  function New (line 27) | func New(data int) *Node {
  function main (line 31) | func main() {

FILE: binary-tree-1-introduction/binary-tree-1-introduction_test.go
  function TestBinaryTreeNew (line 15) | func TestBinaryTreeNew(t *testing.T) {

FILE: binary-tree-2-traversals-in-pre-post-order/binary-tree-traversals-2-in-pre-post-order.go
  type Node (line 12) | type Node struct
    method Init (line 19) | func (n *Node) Init(data int) *Node {
  function New (line 27) | func New(data int) *Node {
  function PrintPostOrder (line 31) | func PrintPostOrder(node *Node) {
  function PrintInOrder (line 47) | func PrintInOrder(node *Node) {
  function PrintPreOrder (line 63) | func PrintPreOrder(node *Node) {
  function main (line 79) | func main() {

FILE: binary-tree-2-traversals-level-order/binary-tree-traversals-2-level-order.go
  type Node (line 12) | type Node struct
    method Init (line 19) | func (n *Node) Init(data int) *Node {
  function New (line 27) | func New(data int) *Node {
  function GetHeight (line 34) | func GetHeight(node *Node) int {
  function PrintGivenLevel (line 52) | func PrintGivenLevel(root *Node, level int) {
  function PrintLevelOrder (line 67) | func PrintLevelOrder(root *Node) {
  function main (line 81) | func main() {

FILE: binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go
  type Node (line 12) | type Node struct
    method Init (line 19) | func (n *Node) Init(data int) *Node {
  function New (line 27) | func New(data int) *Node {
  function InOrder (line 32) | func InOrder(root *Node) {
  function FixPrevPtr (line 48) | func FixPrevPtr(root *Node) {
  function FixNextPtr (line 63) | func FixNextPtr(root *Node) *Node {
  function BTToDLL (line 81) | func BTToDLL(root *Node) *Node {
  function PrintList (line 89) | func PrintList(root *Node) {
  function main (line 96) | func main() {

FILE: binary-tree-4-delete/binary-tree-4-delete.go
  type Node (line 12) | type Node struct
    method Init (line 19) | func (n *Node) Init(data int) *Node {
  function New (line 27) | func New(data int) *Node {
  function DeleteTree (line 34) | func DeleteTree(node *Node) {
  function main (line 50) | func main() {

FILE: binary-tree-5-find-min-max/binary-tree-5-find-min-max.go
  constant MaxUint (line 12) | MaxUint = ^uint(0)
  constant MinUint (line 13) | MinUint = 0
  constant MaxInt (line 14) | MaxInt = int(MaxUint >> 1)
  constant MinInt (line 15) | MinInt = -MaxInt - 1
  type Node (line 17) | type Node struct
    method Init (line 24) | func (n *Node) Init(data int) *Node {
  function New (line 32) | func New(data int) *Node {
  function FindMin (line 37) | func FindMin(root *Node) int {
  function FindMax (line 59) | func FindMax(root *Node) int {
  function main (line 80) | func main() {

FILE: linked-list-1-introduction/linked-list-1-introduction.go
  type Node (line 12) | type Node struct
    method Init (line 18) | func (n *Node) Init() *Node {
    method Next (line 29) | func (n *Node) Next() *Node {
    method Back (line 34) | func (n *Node) Back() *Node {
  function New (line 24) | func New() *Node {
  function printList (line 43) | func printList(n *Node){
  function main (line 50) | func main() {

FILE: linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go
  type Node (line 12) | type Node struct
    method Init (line 18) | func (n *Node) Init() *Node {
    method Next (line 29) | func (n *Node) Next() *Node {
    method Back (line 34) | func (n *Node) Back() *Node {
  function New (line 24) | func New() *Node {
  function Push (line 42) | func Push(head_ref **Node, new_data int) {
  function InsertAfter (line 59) | func InsertAfter(prev_node *Node, new_data int) {
  function Append (line 79) | func Append(head_ref **Node, new_data int) {
  function printList (line 108) | func printList(n *Node){
  function main (line 115) | func main() {

FILE: linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go
  type Node (line 12) | type Node struct
    method Init (line 18) | func (n *Node) Init() *Node {
    method Next (line 29) | func (n *Node) Next() *Node {
    method Back (line 34) | func (n *Node) Back() *Node {
  function New (line 24) | func New() *Node {
  function Push (line 42) | func Push(head_ref **Node, new_data int) {
  function DeleteNodeWithData (line 59) | func DeleteNodeWithData(head_ref **Node, delete_data int) {
  function DeleteNodeWithPosition (line 88) | func DeleteNodeWithPosition(head_ref **Node, delete_position int){
  function printList (line 125) | func printList(n *Node){
  function main (line 132) | func main() {

FILE: linked-list-circular-2-traversal/linked-list-circular-2-traversal.go
  type Node (line 12) | type Node struct
    method Init (line 18) | func (n *Node) Init() *Node {
    method Next (line 29) | func (n *Node) Next() *Node {
    method Back (line 34) | func (n *Node) Back() *Node {
  function New (line 24) | func New() *Node {
  function printList (line 43) | func printList(n *Node) {
  function Push (line 50) | func Push(head_ref **Node, new_data int) {
  function main (line 72) | func main() {

FILE: linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go
  type Node (line 12) | type Node struct
    method Init (line 18) | func (n *Node) Init() *Node {
    method Next (line 29) | func (n *Node) Next() *Node {
    method Back (line 34) | func (n *Node) Back() *Node {
  function New (line 24) | func New() *Node {
  function AddToEmpty (line 43) | func AddToEmpty(last *Node, data int) *Node {
  function AddBegin (line 62) | func AddBegin(last *Node, data int) *Node {
  function AddEnd (line 81) | func AddEnd(last *Node, data int) *Node {
  function AddAfter (line 101) | func AddAfter(last *Node, data int, item int) *Node {
  function Traverse (line 137) | func Traverse(last *Node){
  function printList (line 157) | func printList(n *Node){
  function main (line 164) | func main() {

FILE: linked-list-find-length/linked-list-find-length.go
  type Node (line 12) | type Node struct
    method Init (line 18) | func (n *Node) Init() *Node {
    method Next (line 29) | func (n *Node) Next() *Node {
    method Back (line 34) | func (n *Node) Back() *Node {
  function New (line 24) | func New() *Node {
  function Push (line 42) | func Push(head_ref **Node, new_data int) {
  function GetCount (line 59) | func GetCount(head *Node) int {
  function printList (line 72) | func printList(n *Node){
  function main (line 79) | func main() {

FILE: linked-list-merge-two-sorted/linked-list-merge-two-sorted.go
  type Node (line 12) | type Node struct
    method Init (line 18) | func (n *Node) Init() *Node {
    method Next (line 29) | func (n *Node) Next() *Node {
    method Back (line 34) | func (n *Node) Back() *Node {
  function New (line 24) | func New() *Node {
  function Push (line 42) | func Push(head_ref **Node, new_data int) {
  function MoveNode (line 71) | func MoveNode(dest_ref **Node, source_ref **Node) {
  function SortedMerge (line 88) | func SortedMerge(a *Node, b *Node) *Node {
  function printList (line 121) | func printList(n *Node) {
  function GetDataList (line 129) | func GetDataList(n *Node) []int {
  function main (line 138) | func main() {

FILE: linked-list-merge-two-sorted/linked-list-merge-two-sorted.go_test.go
  function TestMergeTwoSortedNew (line 15) | func TestMergeTwoSortedNew(t *testing.T) {

FILE: linked-list-reverse/linked-list-reverse.go
  type Node (line 12) | type Node struct
    method Init (line 18) | func (n *Node) Init() *Node {
    method Next (line 29) | func (n *Node) Next() *Node {
    method Back (line 34) | func (n *Node) Back() *Node {
  function New (line 24) | func New() *Node {
  function Push (line 42) | func Push(head_ref **Node, new_data int) {
  function Reverse (line 59) | func Reverse(head_ref **Node) {
  function printList (line 75) | func printList(n *Node){
  function main (line 82) | func main() {

FILE: linked-list-reverse/linked-list-reverse_test.go
  function TestLinkedListReverse (line 15) | func TestLinkedListReverse(t *testing.T) {

FILE: merge-sort/merge-sort.go
  function Merge (line 12) | func Merge(arr []int, l, m, r int) {
  function MergeSort (line 61) | func MergeSort(arr []int, l, r int) {
  function PrintArray (line 74) | func PrintArray(A []int, size int) {
  function main (line 81) | func main() {

FILE: merge-sort/merge-sort_test.go
  function TestMergeSort (line 15) | func TestMergeSort(t *testing.T) {

FILE: quick-sort/quick-sort.go
  function Swap (line 12) | func Swap(a *int, b *int) {
  function Partition (line 18) | func Partition(arr []int, start, end int) int {
  function QuickSort (line 43) | func QuickSort(arr []int, start, end int) {
  function PrintArray (line 54) | func PrintArray(arr []int, size int) {
  function main (line 61) | func main() {

FILE: quick-sort/quick-sort_test.go
  function TestQuickSort (line 15) | func TestQuickSort(t *testing.T) {

FILE: stack/stack.go
  constant MaxUint (line 12) | MaxUint = ^uint(0)
  constant MinUint (line 13) | MinUint = 0
  constant MaxInt (line 14) | MaxInt = int(MaxUint >> 1)
  constant MinInt (line 15) | MinInt = -MaxInt - 1
  type Stack (line 17) | type Stack struct
    method Init (line 24) | func (s *Stack) Init(capacity uint) *Stack {
  function New (line 32) | func New(capacity uint) *Stack {
  function IsFull (line 37) | func IsFull(stack *Stack) bool {
  function IsEmpty (line 42) | func IsEmpty(stack *Stack) bool {
  function Push (line 46) | func Push(stack *Stack, item int) {
  function Pop (line 54) | func Pop(stack *Stack) int {
  function main (line 63) | func main() {

FILE: stack/stack_test.go
  function TestStack (line 15) | func TestStack(t *testing.T) {