Example #1
0
 public BinaryTreeNodeParent(int data, BinaryTreeNodeParent left, BinaryTreeNodeParent right)
     : base(data, left, right)
 {
     this.data  = data;
     this.left  = left;
     this.right = right;
 }
Example #2
0
        internal static BinaryTreeNodeParent UnBalancedTreeParent()
        {
            BinaryTreeNodeParent n122       = new BinaryTreeNodeParent(4);
            BinaryTreeNodeParent n11        = new BinaryTreeNodeParent(2);
            BinaryTreeNodeParent n12        = new BinaryTreeNodeParent(3, null, n122);
            BinaryTreeNodeParent n1         = new BinaryTreeNodeParent(5, n11, n12);
            BinaryTreeNodeParent n2         = new BinaryTreeNodeParent(6);
            BinaryTreeNodeParent n3         = new BinaryTreeNodeParent(8);
            BinaryTreeNodeParent n42        = new BinaryTreeNodeParent(1);
            BinaryTreeNodeParent n4         = new BinaryTreeNodeParent(12, null, n42);
            BinaryTreeNodeParent left       = new BinaryTreeNodeParent(8, n1, n2);
            BinaryTreeNodeParent right      = new BinaryTreeNodeParent(11, n3, n4);
            BinaryTreeNodeParent simpleTree = new BinaryTreeNodeParent(10, left, right);

            return(simpleTree);
        }
Example #3
0
        BinaryTreeNodeParent AssignGrandParent(BinaryTreeNodeParent curent)
        {
            if (curent == null)
            {
                return(null);
            }

            if (curent.left != null)
            {
                curent.left.grandParent = curent.parent;
                AssignGrandParent(curent.left);
            }
            if (curent.right != null)
            {
                curent.right.grandParent = curent.parent;
                AssignGrandParent(curent.right);
            }
            return(curent);
        }
Example #4
0
        BinaryTreeNodeParent AssignParent(BinaryTreeNodeParent curent)
        {
            if (curent == null)
                return null;

            if (curent.left != null)
            {
                curent.left.parent = curent;
                AssignParent(curent.left);
            }

            if (curent.right != null)
            {
                curent.right.parent = curent;
                AssignParent(curent.right);
            }
            return curent;
        }
Example #5
0
 internal static BinaryTreeNodeParent UnBalancedTreeParent()
 {
     BinaryTreeNodeParent n122 = new BinaryTreeNodeParent(4);
     BinaryTreeNodeParent n11 = new BinaryTreeNodeParent(2);
     BinaryTreeNodeParent n12 = new BinaryTreeNodeParent(3, null, n122);
     BinaryTreeNodeParent n1 = new BinaryTreeNodeParent(5, n11, n12);
     BinaryTreeNodeParent n2 = new BinaryTreeNodeParent(6);
     BinaryTreeNodeParent n3 = new BinaryTreeNodeParent(8);
     BinaryTreeNodeParent n42 = new BinaryTreeNodeParent(1);
     BinaryTreeNodeParent n4 = new BinaryTreeNodeParent(12, null, n42);
     BinaryTreeNodeParent left = new BinaryTreeNodeParent(8, n1, n2);
     BinaryTreeNodeParent right = new BinaryTreeNodeParent(11, n3, n4);
     BinaryTreeNodeParent simpleTree = new BinaryTreeNodeParent(10, left, right);
     return simpleTree;
 }
Example #6
0
 public BinaryTreeNodeParent(int data, BinaryTreeNodeParent left, BinaryTreeNodeParent right)
     : base(data, left, right)
 {
     this.data = data;
     this.left = left;
     this.right = right;
 }