10 2019 档案

摘要:判断题 1.The inorder traversal sequence of an AVL tree must be in sorted (non decreasing) order. T F 根据二叉搜索树性质,中序遍历一定是有序的,而且是递增的。 2.Insert 1, 2, 3, 4, 5, 阅读全文
posted @ 2019-10-31 13:53 nonlinearthink 阅读(12551) 评论(0) 推荐(0)
摘要:判断题 1.In a singly linked list of N nodes, the time complexities for query and insertion are O(1) and O(N), respectively. T F 查找是O(N),因为需要沿着next指针找下去。而 阅读全文
posted @ 2019-10-24 23:49 nonlinearthink 阅读(12711) 评论(1) 推荐(1)