课堂练习之链表节点删除与构建堆

课堂练习之链表节点删除

Node x = new Node<Integer>();
Node y = new Node<integer>();

x.data = 6;
x.next = y;
y.data = 8;

// 在此处添加7节点
Node z = new Node<Integer>(7,y);
x.next = z;

// 删除7节点
Node curr = x;
Node prev = x;

while(curr.data==7&curr.next!=null){
    prev = curr;
    curr = curr.next;
}
prev.next = curr.next;

构建堆

堆的详细知识点

题目：建成(最大)堆，画出完全二叉树，写出堆排序过程。{29,10,25,26,58,12,31,18,18,47}

错误回答

正确回答