C# (CSharp) BinarySearchTree BinarySearchTree.DepthFirstInOrder Beispiele

Beispiel #1

        private void DepthFirstInOrder(List <int> nums)
        {
            //Left branch traversal
            if (LeftChild != null)
            {
                LeftChild.DepthFirstInOrder(nums);
            }

            //Log current node
            nums.Add(Data);

            //Right branch traversal
            if (RightChild != null)
            {
                RightChild.DepthFirstInOrder(nums);
            }
        }