Esempio n. 1
0
        public construct_btree_from_linkedlist_representation()
        {
            int[] arr = { 36, 30, 25, 15, 12, 10 };

            create_linked_list obj = new create_linked_list(arr);

            Node root = create_tree(obj.head);
        }
        public intersection_point_of_two_linked_lists()
        {
            int[] arr1 = { 30, 15, 9, 6, 3 };
            create_linked_list list1 = new create_linked_list(arr1);


            int[] arr2 = { 30, 15, 10 };
            create_linked_list list2 = new create_linked_list(arr2);

            int res = getIntersection(list1.head, list2.head);
        }